Optimal double circulant self-dual codes over 𝔽4 II
نویسندگان
چکیده
منابع مشابه
Computational Results of Duadic Double Circulant Codes
Quadratic residue codes have been one of the most important classes of algebraic codes. They have been generalized into duadic codes and quadratic double circulant codes. In this paper we introduce a new subclass of double circulant codes, called duadic double circulant codes, which is a generalization of quadratic double circulant codes for prime lengths. This class generates optimal self-dual...
متن کاملType II Self-Dual Codes over Finite Rings and Even Unimodular Lattices
In this paper, we investigate self-dual codes over finite rings, specifically the ring Z2m of integers modulo 2m . Type II codes over Z2m are introduced as self-dual codes with Euclidean weights which are a multiple of 2m+1. We describe a relationship between Type II codes and even unimodular lattices. This relationship provides much information on Type II codes. Double circulant Type II codes ...
متن کاملOn the performance of optimal double circulant even codes
In this note, we investigate the performance of optimal double circulant even codes which are not self-dual, as measured by the decoding error probability in bounded distance decoding. To do this, we classify the optimal double circulant even codes that are not self-dual which have the smallest weight distribution for lengths up to 72. We also give some restrictions on the weight enumerators of...
متن کاملNew self-dual codes of length 72
In this paper we obtain at least 61 new singly even (Type I) binary [72,36,12] self-dual codes as a quasi-cyclic codes with m=2 (tailbitting convolutional codes) and at least 13 new doubly even (Type II) binary [72,36,12] self-dual codes by replacing the first row in each circulant in a double circulant code by "all ones" and "all zeros" vectors respectively. Keywords—convolutional encoding, qu...
متن کاملDouble circulant codes from two class association schemes
Two class association schemes consist of either strongly regular graphs (SRG) or doubly regular tournaments (DRT). We construct self-dual codes from the adjacency matrices of these schemes. This generalizes the construction of Pless ternary Symmetry codes, Karlin binary Double Circulant codes, Calderbank and Sloane quaternary double circulant codes, and Gaborit Quadratic Double Circulant codes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 39 شماره
صفحات -
تاریخ انتشار 2007